Improving BnB-ADOPT+-AC
نویسندگان
چکیده
Several multiagent tasks can be formulated and solved as DCOPs. BnB-ADOPT-AC is one of the most efficient algorithms for optimal DCOP solving. It is based on BnBADOPT, removing redundant messages and maintaining soft arc consistency during search. In this paper, we present several improvements for this algorithm, namely (i) a better implementation, (ii) processing exactly simultaneous deletions, and (iii) searching on arc consistent cost functions. We present empirical results showing the benefits of these improvements on several benchmarks.
منابع مشابه
A Novel Way to Connect BnB-ADOPT+, with Soft AC
Combining BnB-ADOPT$^+$ with AC and FDAC levels of soft arc consistency (SAC) improves efficiency for optimal DCOP solving. However, it seems difficult in distributed context to achieve the higher consistency level EDAC, especially considering privacy. As alternative, we propose DAC by token passing. Agents receiving a token ask neighbors for cost extensions. When deletions or $C_phi$ increment...
متن کاملA Novel Way to Connect BnB-ADOPT+ with Soft AC
Combining BnB-ADOPT$^+$ with AC and FDAC levels of soft arc consistency (SAC) improves efficiency for optimal DCOP solving. However, it seems difficult in distributed context to achieve the higher consistency level EDAC, especially considering privacy. As alternative, we propose DAC by token passing. Agents receiving a token ask neighbors for cost extensions. When deletions or $C_phi$ increment...
متن کاملBnB-ADOPT+ with Several Soft AC Levels
Distributed constraint optimization problems can be solved by BnBADOPT$^+$, a distributed asynchronous search algorithm. In the centralized case, local consistency techniques applied to constraint optimization have been shown very beneficial to increase performance. In this paper, we combine BnB-ADOPT$^+$ with different levels of soft arc consistency, propagating unconditional deletions caused ...
متن کاملGeneralizing ADOPT and BnB-ADOPT
ADOPT and BnB-ADOPT are two optimal DCOP search algorithms that are similar except for their search strategies: the former uses best-first search and the latter uses depth-first branch-and-bound search. In this paper, we present a new algorithm, called ADOPT(k), that generalizes them. Its behavior depends on the k parameter. It behaves like ADOPT when k = 1, like BnB-ADOPT when k = ∞ and like a...
متن کاملMaintaining Soft Arc Consistencies in BnB-ADOPT+ During Search
Distributed Constraint Optimization Problems (DCOPs) have been applied in modeling and solving many multiagent coordination problems, such as meeting scheduling, sensor networks and traffic control. Several distributed algorithms for optimal DCOP solving have been proposed: ADOPT [Modi et al., 2005], DPOP [Petcu and Faltings, 2005], BnB-ADOPT [Yeoh et al., 2010]. BnB-ADOPT-AC and BnB-ADOPTFDAC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012